Relational Semantics for Kleene Logic and Action Logic
نویسندگان
چکیده
منابع مشابه
Relational semantics for full linear logic
Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic. In [DGP05] it is shown that the theory of relational semantics is also available in the more general setting of substructural logic, at least in an algebraic guise. Building on these ideas, in [Geh06] a type of frames is described which generalise Kripke frames and provide semant...
متن کاملMerging Objects and Logic Programming: Relational Semantics
This paper proposes new semantics for merging object programming into logic programming. It differs from previous attempts in that it takes a relational view of method evaluation and inheritance mechanisms originating from object programming. A tight integration is presented, an extended rationale for adopting a success/failure semantics of backtrackable methods calls and for authorizing variab...
متن کاملRelational semantics for a fragment of linear logic
Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic. In [4] it is shown that the theory of relational semantics is also available in the more general setting of substructural logic, at least in an algebraic guise. Building on these ideas, in [5] a type of frames is described which generalize Kripke frames and provide semantics for ...
متن کاملRelational Semantics of Linear Logic and Higher-order Model Checking
In this article, we develop a new and somewhat unexpected connection between higher-order model-checking and linear logic. Our starting point is the observation that once embedded in the relational semantics of linear logic, the Church encoding of a higher-order recursion scheme (HORS) comes together with a dual Church encoding of an alternating tree automata (ATA) of the same signature. Moreov...
متن کاملOn Hoare Logic, Kleene Algebra, and Types
We show that propositional Hoare logic is subsumed by the type calculus of typed Kleene algebra augmented with subtypes and typecasting. Assertions are interpreted as typecast operators. Thus Hoare-style reasoning with partial correctness assertions reduces to typechecking in this system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2005
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1134397663